Consensus on State and Time: Decentralized Regression With Asynchronous Sampling
نویسندگان
چکیده
منابع مشابه
Decentralized and Cooperative Multi-Sensor Multi-Target Tracking With Asynchronous Bearing Measurements
Bearings only tracking is a challenging issue with many applications in military and commercial areas. In distributed multi-sensor multi-target bearings only tracking, sensors are far from each other, but are exchanging data using telecommunication equipment. In addition to the general benefits of distributed systems, this tracking system has another important advantage: if the sensors are suff...
متن کاملAsynchronous Consensus with Bounded Memory
We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n + 1 multi-writer multi-reader (MWMR) registers, each of these registers being of size O(log(n)) bits. Then we get a O(n log(n))-bits size complexity consensus algorithm with single-writer multi-reader (SWMR) registers and ...
متن کاملHigh-speed asynchronous optical sampling with sub-50fs time resolution.
We report an ultrafast time-domain spectroscopy system based on high-speed asynchronous optical sampling operating without mechanical scanner. The system uses two 1 GHz femtosecond oscillators that are offset-stabilized using high-bandwidth feedback electronics operating at the tenth repetition rate harmonics. Definition of the offset frequency, i.e. the time-delay scan rate, in the range of a ...
متن کاملDecentralized Consensus Optimization with Asynchrony and Delay
We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs in a network of agents, where the agents perform local computation and communicate with neighbors. We design our algorithm so that the agents can compute and communicate independently, at different times, for different durations. This reduces the waiting time for the slowest agent or longest commu...
متن کاملAsynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding
Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practical methods for centralized solving of cooperative pathfinding problems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, autonomous und...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2015
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2015.2416687